MDS linear codes with one-dimensional hull

نویسندگان

چکیده

The hull of a linear code C is the intersection with its dual C⊥, where often defined respect to Euclidean or Hermitian inner product. low dimensions gets much interest due crucial role in determining complexity algorithms for computing automorphism group and checking permutation equivalence two codes. Recently, both hulls have found another application quantum error correcting codes entanglements. This paper aims explore explicit constructions families MDS one-dimensional cases. We use tools from algebraic function fields one variable study such Sufficient conditions an geometry genus zero are provided, some construction methods presented. construct many case three case, respectively.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A class of one-dimensional MDS convolutional codes

A class of one-dimensional convolutional codes will be presented. They are all MDS codes, i. e., have the largest distance among all one-dimensional codes of the same length n and overall constraint length δ. Furthermore, their extended row distances are computed, and they increase with slope n − δ. In certain cases of the algebraic parameters, we will also derive parity check matrices of Vande...

متن کامل

Extending MDS Codes

A q-ary (n,k)-MDS code, linear or not, satisfies n≤ q+ k−1. A code meeting this bound is said to have maximum length. Using purely combinatorial methods we show that an MDS code with n = q + k− 2 can be uniquely extended to a full length code if and only if q is even. This result is best possible in the sense that there is, for example, a non-extendable 4-ary (5,4)-MDS code. It may be that the ...

متن کامل

Almost MDS Codes

MDS codes are codes meeting the Singleton bound. Both for theory and practice, these codes are very important and have been studied extensively. Codes near this bound, but not attaining it, have had far less attention. In this paper we study codes that almost reach the Singleton bound.

متن کامل

On MDS elliptic codes

Munuera, C., On MDS elliptic codes, Discrete Mathematics 117 (1993) 2799286. In this paper we give a bound for MDS (maximum distance separable) algebraic-geometric codes arising from elliptic curves. Several consequences are presented.

متن کامل

Explicit MDS Codes with Complementary Duals

In 1964, Massey introduced a class of codes with complementary duals which are called Linear Complimentary Dual (LCD for short) codes. He showed that LCD codes have applications in communication system, side-channel attack (SCA) and so on. LCD codes have been extensively studied in literature. On the other hand, MDS codes form an optimal family of classical codes which have wide applications in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Cryptography and Communications

سال: 2022

ISSN: ['1936-2455', '1936-2447']

DOI: https://doi.org/10.1007/s12095-022-00559-6